The number of edge-disjoint transitive triples in a tournament
نویسنده
چکیده
We prove that a tournament with n vertices has more than 0.13n(1 + o(1)) edge-disjoint transitive triples. We also prove some results on the existence of large packings of k-vertex transitive tournaments in an n-vertex tournament. Our proofs combine probabilistic arguments and some powerful packing results due to Wilson and to Frankl and Rödl.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملNormal edge-transitive Cayley graphs on the non-abelian groups of order $4p^2$, where $p$ is a prime number
In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.
متن کاملOn the Number of 5-Cycles in a Tournament
If T is an n-vertex tournament with a given number of 3-cycles, what can be said about the number of its 4-cycles? The most interesting range of this problem is where T is assumed to have c ⋅ n cyclic triples for some c > 0 and we seek to minimize the number of 4-cycles. We conjecture that the (asymptotic) minimizing T is a random blow-up of a constant-sized transitive tournament. Using the met...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملPacking of three copies of a digraph into the transitive tournament
In this paper, we show that if the number of arcs in an oriented graph −→ G (of order n) without directed cycles is sufficiently small (not greater than 2 3 n− 1), then there exist arc disjoint embeddings of three copies of −→ G into the transitive tournament TTn. It is the best possible bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 287 شماره
صفحات -
تاریخ انتشار 2004